Finding roots in with the successive resultants algorithm
نویسندگان
چکیده
منابع مشابه
Finding Roots in GF(pn) with the Successive Resultant Algorithm
The problem of solving polynomial equations over finite fields has many applications in cryptography and coding theory. In this paper, we consider polynomial equations over a “large” finite field with a “small” characteristic. We introduce a new algorithm for solving this type of equations, called the Successive Resultants Algorithm (SRA) in the sequel. SRA is radically different from previous ...
متن کاملApplication of Collocation Method in Finding Roots
In this paper we present a new method to find simple or multiple roots of functions in a finite interval. In this method using bisection method we can find an interval such that this function is one to one on it, thus we can transform problem of finding roots in this interval into an ordinary differential equation with boundary conditions. By solving this equation using collocation method we ca...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملImproved hybrid algorithm for finding roots of error-locator polynomials
In this paper we suggest a hybrid method for finding toots of error locator polynomials. We first review a fast version of the Chien search algorithm based on the decomposition of the error locator polynomial into a sum of multiples of affine polynomials. We then propose to combine it with modified analytical methods for solution of polynomials of small degree in radicals. We suggest, in partic...
متن کاملProbabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2014
ISSN: 1461-1570
DOI: 10.1112/s1461157014000138